Computability Theory

نویسندگان

  • Amílcar Sernadas
  • Jaime Ramos
چکیده

formalisms of computability

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introduction to Computability Theory

These are notes for a short introductory course on Computability Theory (or recursive function theory). The basic notion of computability is defined in terms of a simple imperative programming language.

متن کامل

Enumeration Reducibility and Computable Structure Theory

In classical computability theory the main underlying structure is that of the natural numbers or equivalently a structure consisting of some constructive objects, such as words in a finite alphabet. In the 1960’s computability theorists saw it as a challenge to extend the notion of computable to arbitrary structure. The resulting subfield of computability theory is commonly referred to as comp...

متن کامل

Computing with functionals - computability theory or computer science?

We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science have shaped this still active subject.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009